LOG-SINE AND LOG-COSINE INTEGRALS

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Log Sine Integrals and the Mordell-tornheim Zeta Values

We introduce certain integrals of a product of the Bernoulli polynomials and logarithms of Milnor’s multiple sine functions. It is shown that all the integrals are expressed by the Mordell-Tornheim zeta values at positive integers and that the converse is also true. Moreover, we apply the theory of the integral to obtain various new results for the Mordell-Tornheim zeta values.

متن کامل

Mahler measures, short walks and log-sine integrals

The Mahler measure of a polynomial in several variables has been a subject of much study over the past thirty years — very few closed forms are proven but more are conjectured. In the case of multiple Mahler measures more tractable but interesting families exist. Using values of log-sine integrals we provide systematic evaluations of various higher and multiple Mahler measures. The evaluations ...

متن کامل

Log-sine Evaluations of Mahler Measures, Ii

We continue our analysis of higher and multiple Mahler measures using log-sine integrals as started in [7, 8]. This motivates a detailed study of various multiple polylogarithms [4] and worked examples are given. Our techniques enable the reduction of several multiple Mahler measures, and supply an easy proof of two conjectures by Boyd.

متن کامل

Log-sine evaluations of Mahler measures

We provide evaluations of several recently studied higher and multiple Mahler measures using log-sine integrals. This is complemented with an analysis of generating functions and identities for log-sine integrals which allows the evaluations to be expressed in terms of zeta values or more general polylogarithmic terms. The machinery developed is then applied to evaluation of further families of...

متن کامل

StUSPACE(log n) <= DSPACE(log²n / log log n)

We present a deterministic algorithm running in space O ? log 2 n= log logn solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(logn) time-bounded algorithm for this problem running on a parallel pointer machine.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Honam Mathematical Journal

سال: 2013

ISSN: 1225-293X

DOI: 10.5831/hmj.2013.35.2.137